منابع مشابه
Distance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ by at most δ, and the smallest δ > 0 for which G is δ-hyperbolic is called the hyperbolicity of G. In this paper, we construct a distance labeling scheme for bounded hyperbolicity graphs, that is a vertex labeling such ...
متن کاملDistance Labeling for Permutation Graphs
We show that every permutation graph with n elements can be preprocessed in O(n) time, if two linear extensions of the corresponding poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The datastructure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bits so that distance queries between any two v...
متن کاملDistance Compatible Set-Labeling Index of Graphs
Distance compatible set-labeling of a graph G is an injective setassignment f : V (G) → 2X , X a nonempty ground set, such that the corresponding induced function f⊕ : V (G)×V (G) → 2X −{∅}, defined by f⊕(u, v) = f(u) ⊕ f(v) satisfies | f⊕(u, v) |= k (u,v) d(u, v) for all distinct u, v ∈ V (G), where d(u, v) is the distance between u and v, and k (u,v) is a constant, not necessarily an integer;...
متن کاملDistance Two Labeling of Some Total Graphs
An L(2, 1)-labeling (or distance two labeling) of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that |f(x) − f(y)| ≥ 2 if d(x, y) = 1 and |f(x) − f(y)| ≥ 1 if d(x, y) = 2. The L(2, 1)-labeling number λ(G) of G is the smallest number k such that G has an L(2, 1)-labeling with max{f(v) : v ∈ V (G)} = k. In this paper we completely determine the λ-...
متن کاملOn distance constrained labeling of disk graphs
A disk graph is the intersection graph of a set of disks in the plane. For a k-tuple (p1, . . . , pk) of positive integers, a distance constrained labeling of a graph G is an assignment of labels to the vertices of G such that the labels of any pair of vertices at graph distance i in G differ by at least pi , for i= 1, . . . , k. In the case when k= 1 and p1 = 1, this gives a traditional colori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2004
ISSN: 0196-6774
DOI: 10.1016/j.jalgor.2004.05.002